翻訳と辞書 Words near each other ・ Graphic Imaging Technology ・ Graphic kit ・ Graphic matroid ・ Graph (mathematics) ・ Graph algebra ・ Graph algebra (social sciences) ・ GRAph ALigner (GRAAL) ・ Graph amalgamation ・ Graph automorphism ・ Graph bandwidth ・ Graph C*-algebra ・ Graph canonization ・ Graph center ・ Graph coloring ・ Graph coloring game ・ Graph continuous function ・ Graph cut ・ Graph cuts in computer vision ・ Graph database ・ Graph drawing ・ Graph dynamical system ・ Graph embedding ・ Graph energy ・ Graph enumeration ・ Graph equation ・ Graph factorization ・ Graph homomorphism ・ Graph isomorphism ・ Graph isomorphism problem ・ Graph kernel Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Graph continuous function ： ウィキペディア英語版 Graph continuous function In mathematics, and in particular the study of game theory, a function is graph continuous if it exhibits the following properties. The concept was originally defined by Partha Dasgupta and Eric Maskin in 1986 and is a version of continuity that finds application in the study of continuous games. ==Notation and preliminaries== Consider a game with $N$ agents with agent $i$ having strategy $A\_i\backslash subseteq\backslash Bbb$; write $\backslash mathbf$ for an N-tuple of actions (i.e. $\backslash mathbf\backslash in\backslash prod\_^NA\_j$) and $\backslash mathbf\_=(a\_1,a\_2,\backslash ldots,a\_,a\_,\backslash ldots,a\_N)$ as the vector of all agents' actions apart from agent $i$. Let $U\_i:A\_i\backslash longrightarrow\backslash Bbb$ be the payoff function for agent $i$. A game is defined as $(i=1,\backslash ldots,N)$. If a graph is continuous you should connect it if it's not then don't connect it. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Graph continuous function」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.